- inconsistent formula
- мат.противоречивая формула
English-Russian scientific dictionary. 2008.
inconsistent formula
Смотреть что такое "inconsistent formula" в других словарях:
Propositional formula — In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional… … Wikipedia
Zeiss formula — In photographic optics, the so called Zeiss formula is sometimes said to be used for computing a circle of confusion (CoC) criterion for depth of field (DOF) calculations. The formula is c = d/1730, where d is the diagonal measure of a camera… … Wikipedia
Benjamin Graham formula — In The Intelligent Investor , Benjamin Graham describes a formula he used to value stocks. He disregarded complicated calculations and kept his formula simple. In his words: “Our study of the various methods has led us to suggest a foreshortened… … Wikipedia
Organic infant formula — Organic infant formulas are synthetic substitutes to natural breast milk. Organic formulas, as well as other organic foods, manufactured in the United States must be meet specific conditions regulated by the United States Department of… … Wikipedia
consistent/inconsistent — Intuitively a group of propositions is consistent if they could all be true together. In formal logic various other notions are defined. A system is consistent if it does not yield both a formula and its negation, or consistent if not all well… … Philosophy dictionary
Proof complexity — In computer science, proof complexity is a measure of efficiency of automated theorem proving methods that is based on the size of the proofs they produce. The methods for proving contradiction in propositional logic are the most analyzed. The… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Default logic — is a non monotonic logic proposed by Raymond Reiter to formalize reasoning with default assumptions. Default logic can express facts like “by default, something is true”; by contrast, standard logic can only express that something is true or that … Wikipedia
Entailment — For other uses, see Entail (disambiguation). In logic, entailment is a relation between a set of sentences (e.g.,[1] meaningfully declarative sentences or truthbearers) and a sentence. Let Γ be a set of one or more sentences; let S1 be the… … Wikipedia
Paraconsistent logic — A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing paraconsistent (or… … Wikipedia
Belief revision — is the process of changing beliefs to take into account a new piece of information. The logical formalization of belief revision is researched in philosophy, in databases, and in artificial intelligence for the design of rational agents.What… … Wikipedia
